Determining Location and Direction of Travel Using Map Vector Constraints

ABSTRACT

Systems, methods, and computer program products for determining the location and direction of travel of a mobile device using map vector constraints is disclosed.

CROSS-RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No. 13/913,006, entitled “Determining Location and Direction of Travel Using Map Vector Constraints,” filed Jun. 7, 2013, which claims the benefit of priority of U.S. Provisional Application No. 61/657,695, for “Determining Location and Direction of Travel Using Map Vector Constraints,” filed Jun. 8, 2012, the entire contents of each of which are incorporated herein by reference.

TECHNICAL FIELD

This disclosure is related generally to navigation systems.

BACKGROUND

Many modern smart phones and other mobile devices (e.g., electronic tablets) include navigation subsystems for allowing a user to track their location or the location of others on a digital map. Satellites, cell towers or network access points (e.g., Wi-Fi) can be used to acquire position data to locate a user on a road in a map database. Using the map database, the navigation system can give directions to other locations along roads also in the map database. Dead reckoning using data from sensors (e.g., accelerometers, gyroscopes) can be used to compute position data when position data is unavailable (e.g., lost satellite signals due to multipath or loss of line of sight).

A map database represents a road network and its associated features. Some examples of features include nodes, links and areas. Each feature can have attributes, such as location coordinates, shape, addresses, road class, speed range, etc. Other information associated with the road network can also be included in the map database, such as points of interest, building shapes, and political boundaries. Map databases can be provided in standardized file formats, such as Geographic Data Files (GDF).

In the map database, each node can represent a point location of the surface of the Earth and can be defined on the a map by a pair of longitude and latitude coordinates. Each link in the map database can represent a stretch of road between two nodes. Links can be represented by a line segment corresponding to a straight section of road or a curve having a shape that can be described by shape points along the link. Curves in the road can be represented by a combination of centroid (point or node), with a radius, and polar coordinates to define the boundaries of the curve. Like nodes, shape points can be defined by longitude and latitude coordinates. Shape points, however, do not connect links. Areas can be two-dimensional shapes that represent things or places, such as parks, cities and blocks. Areas can be defined by boundaries, usually formed by a closed polygon.

SUMMARY

Systems, methods, and computer program products for determining the location and direction of travel of a mobile device using map vector constraints is disclosed. In some implementations, a method comprises: performing particle seeding on a road network surrounding a set of measurements; propagating the particles along the road network; calculating relative particle weights; resampling the particles; computing a particle filter solution; comparing the particle filter solution with an instantaneous matcher; and calculating a map-match given the particles.

Particular implementations disclosed herein provide one or more of the following advantages: 1) activity context is used in a map-matching process to better assess the hypothesis that the mobile device is on the map, to adapt the process used to determine the probability of a specific snap point by potentially favoring direction of travel information when the mobile device is mounted to a vehicle and to adapt the map-matching behavior based on user activity; 2) Wi-Fi locations are fed, when available and appropriate, to a Global Navigation Satellite System (GNSS) receiver as tightly coupled position assistance to improve the ability of the GNSS receiver to reject bad GNSS pseudorange and/or Doppler measurements; and 3) map-matched locations that meet certain acceptability criteria are fed to the GNSS receiver as tightly coupled position assistance to improve the ability of the GNSS receiver to reject bad GNSS pseudorange and/or Doppler measurements.

The details of the disclosed implementations are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description and drawings, and from the claims.

DESCRIPTION OF DRAWINGS

FIG. 1 illustrates a Global Positioning System (GPS) statistical confidence region for position.

FIG. 2 is a graph illustrating a particle propagation example.

FIG. 3 is a graph illustrating a particle propagation example when static.

FIG. 4 illustrates a solution extraction with two connected road links.

FIG. 5 illustrates a solution extraction with multiple connected links.

FIG. 6 illustrates a solution union detected between connected links.

FIG. 7 is a flow diagram of an example process for determining location and direction of travel using map vector constraints.

FIG. 8 is a block diagram of a system for determining location and direction of travel using map vector constraints.

FIG. 9 is a block diagram of an exemplary operating environment capable of determining location and direction of travel of a mobile device using map vector constraints.

FIG. 10 is a block diagram of an exemplary architecture of a device capable of determining location and direction of travel using map vector constraints.

FIG. 11 illustrates a method of constraining candidate road points to be on a road.

The same reference symbol used in various drawings indicates like elements.

DETAILED DESCRIPTION Map Matching Inputs

Map matching includes constraining position and velocity information to a network of road links. A road link can be described by a sequence of linear line segments. Each linear line segment can be a simple vector defined by two sets of coordinates, (λ₁, φ₁) and (λ₂, φ₂). Coordinates can be defined with respect to a reference frame (e.g., WGS84 Earth-centered-Earth-fixed (ECEF) reference frame) for convenient use with a GNSS, such as the Global Positioning System (GPS).

GPS Inputs

A typical GPS observation provides the following information:

-   -   φ latitude (degs)     -   λ longitude (degs)     -   a the semi-major axis (m) of the position uncertainty confidence         region at a probability level (e.g., a 39% probability level)     -   b the semi-minor axis (m) of the position uncertainty confidence         region at a probability level (e.g., a 39% probability level)     -   θ the azimuth of a (degs)     -   v_(e) the east component of velocity (m/s)     -   v_(n) the north component of velocity (m/s)

FIG. 1 illustrates a GPS statistical confidence region for position. As illustrated in FIG. 1, GPS position estimates have an associated statistical confidence region in two dimensions, which can be represented by ellipse 100. The parameters of ellipse 100 (a, b, θ) define a confidence region (e.g., a 39% confidence region), provided the parameters are derived as described by Equations [1] through [4] below. The covariance matrix associated with the GNSS position solution is given by

$\begin{matrix} {\begin{bmatrix} \sigma_{e}^{2} & \sigma_{en} \\ \sigma_{en} & \sigma_{n}^{2} \end{bmatrix},} & \lbrack 1\rbrack \end{matrix}$

where σ_(e)(m) and σ_(n)(m) is the uncertainty of the GPS covariance matrix in the east and north directions, respectively, and σ_(en)(m) is the covariance between the east and north components. The parameters a, b, θ can be derived from Equation [2] by

$\begin{matrix} {{a = \sqrt{{\frac{1}{2}\left( {\sigma_{e}^{2} + \sigma_{n}^{2}} \right)} + \sqrt{{\frac{1}{4}\left( {\sigma_{e}^{2} - \sigma_{n}^{2}} \right)^{2}} + \sigma_{en}^{2}}}},{b = \sqrt{{\frac{1}{2}\left( {\sigma_{e}^{2} + \sigma_{n}^{2}} \right)} - \sqrt{{\frac{1}{4}\left( {\sigma_{e}^{2} - \sigma_{n}^{2}} \right)^{2}} + \sigma_{en}^{2}}}},{\theta = {{- \frac{1}{2}}{\tan^{- 1}\left( \frac{2\sigma_{en}}{\sigma_{e}^{2} - \sigma_{n}^{2}} \right)}}},} & \lbrack 2\rbrack \end{matrix}$

where

-   -   a the semi-major axis (m) of the position uncertainty confidence         region at a probability level (e.g., a 39% probability level),     -   b the semi-minor axis (m) of the position uncertainty confidence         region at a probability level (e.g., a 39% probability level),     -   θ the azimuth of a (degs).

Note that most GPS receiver estimation processes output a and b scaled by 2.45 to achieve a confidence region with a 95% probability level. The covariance matrix can be recovered from the parameters a, b, θ using Equation [3] given by

$\begin{matrix} {{\sigma_{en}^{2} = {\frac{\left( {a^{2} - b^{2}} \right)^{2}}{4} \cdot \frac{\tan^{2}\left( {{- 2}\theta} \right)}{{\tan^{2}\left( {{- 2}\theta} \right)} + 1}}},{\sigma_{e}^{2} = {\frac{1}{2}\left( {\frac{2\sigma_{en}}{\tan \left( {{- 2}\theta} \right)} + a^{2} + b^{2}} \right)}},{\sigma_{n}^{2} = {\frac{1}{2}{\left( {{- \frac{2\sigma_{en}}{\tan \left( {{- 2}\theta} \right)}} + a^{2} + b^{2}} \right).}}}} & \lbrack 3\rbrack \end{matrix}$

In the event that only horizontal distance root means square (DRMS) uncertainty, σ_(DRMS) which has a 63-68% confidence region, is available from the GPS receiver, the following covariance matrix should be used.

σ_(en) ²=0,

σ_(e) ²=(σ_(DRMS) ²)/2,

σ_(n) ²=(σ_(DRMS) ²)/2.  [4]

GPS Velocity

Often the GPS velocity information is provided as speed ∥v∥ and direction of travel a rather than velocity in the east and north directions. The direction of travel can be defined as the clockwise azimuth angle from true north. This relationship is given by

$\begin{matrix} {{\alpha = {\tan^{- 1}\frac{\upsilon_{e}}{\upsilon_{n}}}},{{\upsilon } = \sqrt{\upsilon_{e}^{2} + \upsilon_{n}^{2}}},{\upsilon_{e} = {{\upsilon }{\sin (\alpha)}}},{\upsilon_{n} = {{\upsilon }{{\cos (\alpha)}.}}}} & \lbrack 5\rbrack \end{matrix}$

Map-Match Likelihood

The quality of an instantaneous map-match can be given by the weighted combination of the distance to the road link point and the difference between the road link azimuth and the GPS direction of travel (azimuth with respect to truth north). This can be expressed in probabilistic terms by evaluating the following multivariate normal distribution given by

$\begin{matrix} {{{p\left( z_{k} \middle| x_{j} \right)} = {\frac{1}{\sqrt{\left( {2\pi} \right)^{n}{R_{k}}}}^{{- \frac{1}{2}}{({z_{k} - x_{j}})}^{T}}{R_{k}^{- 1}\left( {z_{k} - x_{j}} \right)}}},} & \lbrack 6\rbrack \end{matrix}$

where p(z_(k)|x_(j)) is the probability of the measurements given a specific road link point j, n is the number of measurements (e.g., n=3) for GPS position and azimuth as inputs, z_(k) is the vector of measurements for the k^(th) epoch, R_(k) is the measurement covariance matrix.

The term z_(k)−x_(j) in [6] can be evaluated as follows:

$\begin{matrix} {{{z_{k} - x_{j}} = \begin{bmatrix} \begin{matrix} \frac{\left( {\lambda_{k} - \lambda_{j}} \right)}{\left( {N + h} \right){\cos \left( \lambda_{k} \right)}} \\ \frac{\left( {\varphi_{k} - \varphi_{j}} \right)}{\left( {M + h} \right)} \end{matrix} \\ {\alpha_{k} - \alpha_{j}} \end{bmatrix}},} & \lbrack 7\rbrack \end{matrix}$

where φ_(k) and λ_(k) is the position measurement, h is the associated height measurement (WGS84), if available (h=0 otherwise), φ_(j) and λ_(k) is the road link position, M is the meridian radius of curvature, N is the prime vertical radius of curvature, α_(k) is the measured azimuth, α_(j) is the road link azimuth, The meridian radius of curvature (for WGS84) can be calculated by

$\begin{matrix} {{M = \frac{a\left( {1 - e^{2}} \right)}{W}},{where}} & \lbrack 8\rbrack \\ {{a = 6378137.0},{e^{2} = 0.00669437999014132},{W = {\sqrt{1 - {e^{2}*{\sin^{2}(\varphi)}}}.}}} & \lbrack 9\rbrack \end{matrix}$

The prime vertical radius of curvature can be calculated by

$\begin{matrix} {N = {\frac{a}{W}.}} & \lbrack 10\rbrack \end{matrix}$

Variance-Covariance of Observations

The variance of the observations R_(k) can be given by

$\begin{matrix} {R_{k} = \begin{bmatrix} {\sigma_{e}^{2} + \sigma_{map}^{2}} & \sigma_{en} & 0 \\ \sigma_{en} & {\sigma_{n}^{2} + \sigma_{map}^{2}} & 0 \\ 0 & 0 & {\sigma_{\alpha}^{2} + \sigma_{\alpha \; {lane}}^{2} + \sigma_{\sigma \; {road}}^{2}} \end{bmatrix}} & \lbrack 11\rbrack \end{matrix}$

Two new parameters are introduced in Equation [11] to account for uncertainty in the road-map data.

σ_(map) is the map data uncertainty. The quality of the road model is included in the estimation by this parameter. σ_(αlane) ² is the uncertainty in the vector direction of travel due to typical lane changes. This parameter may be a function of speed and or the road class or other road features. σ_(αroad) ² is the uncertainty in the vector direction of the road link data. This is due to map digitization (quantization). This parameter may be a function of the road class or other road feature information.

The term σ_(α) ² may not be output by the GPS estimation process. Since a is derived as a function of the GPS velocity, its variance is a function of the magnitude of the GPS velocity. Hence, there is an inverse exponential relationship between σ_(α) ² and GPS speed. In non-driving cases, a is not useful below speeds of 2 to 3 m/s and may likely just be an erroneous input. However, in driving cases, a is a filtered quantity that is the propagated direction of travel and may be useful even when static. Care should be taken to make more use of a when speeds are low when driving. One means of accomplishing this would be to only allow a to be used when the driving context is known and the GPS speed is below 2-3 m/s while the GPS position uncertainty is also below a threshold value (e.g., 30 m) given by

σ_(α) ² ∝f(∥v∥).  [12]

If the user's device is mounted in a vehicle and angle measurements (e.g., gyro measurements) are available, then these angle measurements can be used in the GPS estimation process to output an enhanced course measurement. In this case, the variance of the course measurement σ_(α) ² is not necessarily a function of the GPS speed. The σ_(α) ² provided by the GPS estimation process may be used.

Calculation of Course Uncertainty from Velocity

The calculation of σ_(α) ² from GPS velocity is given by Equations [13]-[15].

$\begin{matrix} {{\alpha = {{atan}\left( \frac{v_{e}}{v_{n}} \right)}}{a = {\frac{\partial\alpha}{\partial v_{n}} = {\frac{- v_{e}}{v_{n}^{2}}\frac{1}{1 + \left( \frac{v_{e}}{v_{n}} \right)^{2\;}}}}}{b = {\frac{\partial\alpha}{\partial v_{e}} = {\frac{1}{v_{n}}\frac{2}{1 + \left( \frac{v_{e}}{v_{n}} \right)^{2}}}}}} & \lbrack 13\rbrack \end{matrix}$

Applying Covariance Law gives

$\begin{matrix} {{y = {f(z)}},{C_{y} = {\frac{\partial f}{\partial z}C_{z}\frac{\partial f^{T}}{\partial z}}},} & \lbrack 14\rbrack \end{matrix}$

where, when applied to estimating course uncertainty, z and C_(z) are the velocity states and associated covariance matrix, respectively, and C_(y)=C_(α) is the covariance of the course.

$\begin{matrix} {{\frac{\partial f}{\partial z} = \left\lbrack {a\mspace{14mu} b} \right\rbrack}{{C_{z} = \begin{bmatrix} \sigma_{v_{n}}^{2} & \sigma_{ven} \\ \sigma_{{ven}\;} & \sigma_{v_{e}}^{2} \end{bmatrix}},{C_{\alpha} = {\sigma_{\alpha}^{2} = {{a^{2}\sigma_{v_{n}}^{2}} + {2{ab}\; \sigma_{v_{en}}} + {b^{2}\sigma_{v_{e}}^{2}}}}},}} & \lbrack 15\rbrack \end{matrix}$

Note that there are three special cases including two special cases (case #2 and case #3) that require the application of the limit theorem. The unit for σ_(α) is radians.

Case #1. v_(n)=0, v_(e)=0: No solution.

Case #2. v_(n)=0, v_(e)≠0:

$\sigma_{\alpha}^{2} = {\frac{\sigma_{v_{n}}^{2}}{v_{e}^{2}}.}$

Case #3. v_(e)=0, v_(n)≠0:

$\sigma_{\alpha}^{2} = {\frac{\sigma_{v_{e}}^{2}}{v_{n}^{2}}.}$

Relative Likelihood of a Map-Match

The relative likelihood of a map-match with respect to all other considered map-matches in a set can be given by Equation [16]:

$\begin{matrix} {w_{j} = {\frac{p\left( z_{k} \middle| x_{j} \right)}{\sum\limits_{i = 1}^{N}{p\left( z_{k} \middle| x_{j} \right)}}.}} & \lbrack 16\rbrack \end{matrix}$

Particle Filter Approach to Map-Matching

FIG. 7 is a flow diagram of an example process 700 for determining location and direction of travel using map vector constraints. The basic concept of the particle filter is that a large number of particles are used to represent the state space distribution of the solution. The number of samples, N, must be sufficiently large to capture the distribution. In some implementations, process 700 can be implemented by system 800 as described in reference to FIG. 8.

In some implementations, process 700 can begin by performing particle seeding on a road network surrounding a first set of measurements (702), propagating the particles along the road network (704), calculating relative particle weights (706), resampling the particles (708), computing a particle filter solution (710), comparing the particle filter solution with an instantaneous matcher (712) and calculating a best map-match given the particles (714). Each of these process steps is described in more detail below.

A Particle as an Object

A particle is a spatial object that is constrained to the allowable map state space and contains the following information:

j, particle index, iε[0, 1, . . . N−1], φ, latitude constrained to the map λ, longitude constrained to the map a, altitude (above the geoid, approximate means sea level) α, course or direction of travel based on the map p(z_(k)|x_(j)), instantaneous map-match likelihood (unfiltered) ω_(j), instantaneous relative likelihood (unfiltered) r_(k), a road link index

MM Particle Filter Initialization Using Instantaneous-Scored Method

The particle filter can be initialized given road map data and initial measurements from the set including position (latitude and longitude), direction of travel (GPS course) and speed. This seeding can be referred to as the calculation of the instantaneous-scored method.

Road map data is comprised of linear line segments. For each of the line segments within a distance, d, of the position measurement, the point on the line segment that is closest to the position can be evaluated using p(z_(k)|x_(j)) given by Equation [6]. These points can be used to assign particles using the following steps:

1. Obtain a set of measurements, including at least a position. 2. Calculate DRMS, a 2-dimensional (1D) measure of the position uncertainty.

-   -   DRMS=√{square root over (a² b²)}     -   Note: when a and b are not available, DRMS can be the reported         uncertainty statistic. This statistic can have a 63-68%         probability region.         3. If DRMS>x meters (e.g., 100 m), the particle filter solution         is not good enough and the next available solution should be         used.         4. Calculate d, the distance to use when searching for         surrounding road links in the road network.     -   An example value ford can be d=min(max(3.0*DRMS, 50.0), 300).         5. Search for the road links (linear segments) within the         distance, d, of the position         6. Find the closest point on each road link and the direction of         travel for this link point, x_(j=1 . . . N). If there are two         possible directions of travel for a road link, then there may be         two road link sets with the same road link position but opposite         directions of travel.         7. Assign a particle to each of these road link points. Each         particle has an associated state vector x_(j).         8. Calculate the scores for each assigned particle         p(z_(k)|x_(j)).         9. Calculate the relative likelihoods for each particle ω_(j)         for each assigned particle.         10. Store the solutions for the particles with the highest and         second highest relative likelihoods.         11. Compute the ratio of the highest to the second highest         stored relative likelihood values. If this ratio value exceeds a         threshold, r>r_(instant), then it may be reasonable to release         an instantaneous map-match solution.         12. Use the resampling process to assign the remaining particles         (without replacement of the already assigned particles).         13. Since many particles are often assigned to the same location         on a road link, this is equivalent to a potential solution with         a very low uncertainty. This may be an undesirable way to seed         the particle filter. Thus, additional process noise can be added         to the ensuring prediction step following initialization.

MM Particle Filter Prediction

Particles can be propagated in a one-dimensional sense along road links and across intersections. This propagation is governed by Equation [17]:

$\begin{matrix} {{d_{k} = {d_{k - 1} + {{\upsilon\Delta}\; T} + q}}{\upsilon = \frac{\left( {v_{k - 1} + v_{k}} \right)}{2.0}}{q \in {N\left( {0,\sigma_{q}^{2}} \right)}}{\sigma_{q}^{2} = {\sigma_{r}^{2} + \sigma_{v}^{2} + \sigma_{\varepsilon_{v}}^{2}}}{\sigma_{r}^{2} = \sigma_{roughening}^{2}}{\sigma_{{roughening}_{\; {static}}}^{2} = {\sigma_{rs}^{2} = {{1.0 \cdot \Delta}\; T^{2}}}}{\sigma_{{roughening}_{\; {moving}}}^{2} = {\sigma_{rm}^{2} = {{2.0 \cdot \Delta}\; T^{2}}}}{\sigma_{v}^{2} = {\left( {{0.25\sigma_{\upsilon_{k}}^{2}} + {0.25\sigma_{\upsilon_{k - 1}}^{2}}} \right)\Delta \; T^{2}}}{\sigma_{\varepsilon_{\upsilon}}^{2} = {\left( \frac{\upsilon_{k} - \upsilon_{k - 1}}{4} \right)^{2}\Delta \; T^{2}}}} & \lbrack 17\rbrack \end{matrix}$

where ΔT is the time difference between updates d_(k) is the distance along a line at time k d_(k-1) is the distance along a line at time k−1 v is the average speed over the timespan between t_(k-1) and t_(k) q is a process noise value that is randomly selected from a zero-mean normal distribution. σ_(q) ² is the variance of the process noise. σ_(roughening) ² or σ_(r) ² is the process noise added to prevent sample impoverishment and to provide a base level of system process noise. This is one of two values for moving and not-moving cases based on motion context from accelerometers. σ_(v) ² is the process noise added due to uncertainty in the speed estimates provided by the GPS receiver or modeled. σ_(εv) ² is the process noise added due to non-linearity in the speed used for the prediction step. This is one-half of the maximum speed error in the average speed estimate. The worst-case average speed error is a step function between k−1 and k, which is half the speed difference. Half of half the speed difference (¼ of the speed difference) is a good nominal process noise value. For example, if the maximum speed difference is 10 m/s, then the maximum average speed error is 5 m/s and the additional process noise would be 2.5 m/s squared multiplied by the squared time difference.

Process Noise Example

FIG. 2 is a graph illustrating a particle propagation example. The following values demonstrate an example case for finding the appropriate distribution from which to draw process noise samples. This is visualized in FIG. 2.

At the first epoch, all the particles are located at distance d₁=0. There are 100 particles, which are propagated along the link based on the following information.

$\begin{matrix} {{{\Delta \; T} = 1.0}{v_{k} = {10\mspace{11mu} \left( {m\text{/}s} \right)}}{v_{k - 1} = {15\mspace{11mu} \left( {m\text{/}s} \right)}}{v = {\frac{\left( {v_{k - 1} + v_{k}} \right)}{2.0} = {\frac{10.0 + 15.0}{2.0} = {12.5\left( {m\text{/}s} \right)}}}}{d_{1} = 0}{d_{2} = {{d_{k - 1} + {v\; \Delta \; T} + q} = {12.5 + q}}}{\sigma_{v_{k}} = {1.8\mspace{11mu} \left( {m\text{/}s} \right)}}{\sigma_{v_{k - 1}} = {3.2\mspace{11mu} \left( {m\text{/}s} \right)}}{\sigma_{v}^{2} = {{\left( {{0.25\sigma_{v_{k}}^{2}} + {0.25\sigma_{v_{k - 1}}^{2}}} \right)\Delta \; T^{2}} = {3.7\mspace{14mu} m^{2}}}}{\sigma_{ɛ_{v}}^{2} = {{\left( \frac{v_{k} - v_{k - 1}}{4} \right)^{2}\Delta \; T^{2}} = {1.5625\mspace{14mu} m^{2}}}}{\sigma_{r}^{2} = {\sigma_{r_{m}}^{2} = {{2\Delta \; T^{2}} = {2.0\mspace{14mu} m^{2}}}}}{\sigma_{q}^{2} = {{2.0 + 3.7 + 1.5625} = {7.2625\mspace{14mu} m^{2}}}}{{q \in {N\left( {0,\sigma_{q}^{2}} \right)}} = {q \in {N\left( {0,{7.2625\mspace{14mu} m^{2}}} \right)}}}} & \lbrack 18\rbrack \end{matrix}$

Example Particle Propagation when Static

FIG. 3 is a graph illustrating a particle propagation example when static. The following values demonstrate a static example case for finding the appropriate distribution from which to draw process noise samples. This is visualized in FIG. 3.

At the first epoch, all the particles are located at distance d₁=0. There are 1000 particles, which are propagated along the link based on the following information.

$\begin{matrix} {{{\Delta \; T} = 1.0}{v_{k} = {{0\mspace{11mu} \left( {m\text{/}s} \right)v_{k - 1}} = {{0\mspace{11mu} \left( {m\text{/}s} \right)\sigma_{v_{k}}} = {{0.0\mspace{11mu} \left( {m\text{/}s} \right)\sigma_{v_{k - 1}}} = {{0.0\mspace{11mu} \left( {m\text{/}s} \right)\sigma_{v}^{2}} = {{\left( {{0.25\sigma_{v_{k}}^{2}} + {0.25\sigma_{v_{k - 1}}^{2}}} \right)\Delta \; T^{2}} = {{0\mspace{14mu} m^{2}\sigma_{ɛ_{v}}^{2}} = {{\left( \frac{v_{k} - v_{k - 1}}{4} \right)^{2}\Delta \; T^{2}} = {0\mspace{14mu} m^{2}}}}}}}}}}{\sigma_{r}^{2} = {\sigma_{r_{s}}^{2} = {{1.0\Delta \; T^{2}} = {10\mspace{14mu} m^{2}}}}}{\sigma_{q}^{2} = {1.0 = {1.0\mspace{14mu} m^{2}}}}{{q \in {N\left( {0,\sigma_{q}^{2}} \right)}} = {q \in {N\left( {0,{1.0\mspace{14mu} m^{2}}} \right)}}}} & \lbrack 19\rbrack \end{matrix}$

Making Use of Moving/not-Moving Indications

The moving/not-moving indication computed by context detection using on-device motion sensors (e.g., accelerometers) can be used to force the velocity used in the prediction step to zero and to reduce the process noise used in the prediction step. If static, the following applies.

$\begin{matrix} {{v_{k} = {0\mspace{11mu} \left( {m\text{/}s} \right)}}{v_{k - 1} = {0\mspace{11mu} \left( {m\text{/}s} \right)}}{\sigma_{v_{k}} = {0.0\mspace{11mu} \left( {m\text{/}s} \right)}}{\sigma_{v_{k - 1}} = {0.0\mspace{11mu} \left( {m\text{/}s} \right)}}{\sigma_{v}^{2} = {{\left( {{0.25\sigma_{v_{k}}^{2}} + {0.25\sigma_{v_{k - 1}}^{2}}} \right)\Delta \; T^{2}} = {0\mspace{14mu} m^{2}}}}{\sigma_{ɛ_{v}}^{2} = {{\left( \frac{v_{k} - v_{k - 1}}{4} \right)^{2}\Delta \; T^{2}} = {0\mspace{14mu} m^{2}}}}{\sigma_{q}^{2} = \sigma_{r}^{2}}} & \lbrack 20\rbrack \end{matrix}$

Propagation of Particles Across Intersections

Particles are propagated along road links until they hit an intersection. Particles are propagated onto new links following the intersection using the following concepts.

-   -   If there is only one outgoing link, then the selection is         trivial.     -   If there are multiple outgoing links with equal likelihood of         travel, then particles are randomly assigned to propagate along         the new links     -   If additional information is known about the outgoing road         links, then more particles may be assigned to certain outgoing         links than others. These cases include the following.         -   If the incoming link is a freeway and the outgoing links are             a freeway and an offramp, then the freeway is favored unless             routing information is available and indicates that the             offramp should be taken. In the latter case, the off-ramp is             favored.         -   If the outgoing links have different road class, then one             road class may be favored more than another.         -   If routing information is available, then the outgoing road             link indicated by the routing information is potentially             favored.

MM Particle Filter Update

The update step includes calculating the relative particle weights given a new set of measurements and resampling of the particles.

Calculation of Relative Particle Weights

Following the prediction step, particles are updated based on the set of available measurements (including position) by computing p(z_(k)|x_(j)) and w_(j) from Equations [6] and [16], respectively.

Use of Activity Detection

If activity detection using motion sensors (e.g., accelerometers) is enabled, and pedestrian motion is detected, it is important that the calculation of p(z_(k)|x_(j)) and w_(j) do not use course information.

Resampling

Resampling is performed using the following steps:

-   1. Create a new vector of unassigned particle of length N -   2. Generate a random number, r_(i), that is uniformly distributed on     [0,1]. For computational efficiency, a number of random vectors,     that are indexed based on particle index, could be generated offline     and stored for use. -   3. Accumulate the relative likelihoods, w_(j), into a cumulative     summation vector, CSW. This vector has N elements -   4. For each r_(i):     -   a. Find the index of the first element in CSW_(i) that is         greater than or equal to r     -   b. Copy the particle with this index into the new particle         vector     -   c. Assign the particle a relative likelihood, w_(i)=N⁻¹

The above method is described in, for example, Simon, D., “Optimal State Estimation,” John Wiley and Sons Inc. (2006), p. 467 and in Ristic, B., S. Arulampalam and N. Gordon, “Beyond the Kalman Filter, Particle Filters for Tracking Applications,” Artech House (2004), p. 41. Each of these references is incorporated by reference herein in its entirety.

MM Particle Filter Depletion Check

Every few epochs, the solution should be checked for complete sample impoverishment or solution depletion. This could occur for various reasons include accumulated errors in particle prediction, travel over an undocumented road link (e.g., across a parking lot), map errors, etc. The check is accomplished by running the particle filter initialization steps in a parallel solution (up to step 12). The current particle filter solution is compared to the best and second-best solutions from the initialization method using a ratio test. If the ratio test exceeds a threshold value, then the particle filter is re-seeded with this information.

MM Particle Filter Solution Extraction

The challenge in solution extraction is that the particles can be distributed across connected links. If single links are compared independently, then an erroneous solution could be extracted. This problem is illustrated by FIG. 4 and FIG. 5.

In FIG. 4, the best solution is clearly the union of the particles across the connected links r₀ and r₁. If individual links only were considered, then the first moment (mean) of the particles on r₂ would be selected as the most likely solution.

In FIG. 5, the solution is most likely within the intersection of r₁ and r₅, and it is clear that only using individual links does not provide the most likely solution. The concept of solution union across connected links is not quite this simple as particles could be spread far along both connected links. Thus, the first and second movements of the particle distributions along two connected links are used to detect potential solution union. This concept is illustrated in FIG. 6. Note, that solution from the union between only two links is considered. This is based on the fact that a user always moves from one link to one other link. It may be that the particles are spread amongst all the outgoing links of an intersection but it is likely that the single union between the two most likely links will be a higher relative likelihood solution than a solution that is not part of the intersection.

The method to determine the most likely solution is as follows.

-   1. Determine the possible road links -   2. For each road link:     -   a. Compute the mean distance and the variance of the particles         along the road link. Compute the position associated with the         mean distance along the road link,     -   b. Generate a list of connected road links. -   3. For each road link, k     -   a. Count the number of particles within F times the standard         deviation of the mean distance, N_(i).     -   b. Compute the relative likelihood of this solution as the         number of particles divided by the total number of particles,         w_(k)=N_(i)/N.     -   c. Add this solution to the list of possible solutions.     -   d. For each connected road link, j         -   i. Check if w_(ij), i.e., w_(ji), is already included in the             list of possible solutions.         -   ii. Examine the connected road links to see if there is a             probable overlap of the solutions of both links. If the mean             position plus or minus Γ times the standard deviation of the             solution (e.g., Γ=3) includes the solution from the other             road link, then the union of the two road links should be             considered.         -   iii. If overlapped, count the number of particles within F             times the standard deviation of the mean position of the             union of the two road links.         -   iv. If overlapped, compute the relative likelihood of the             solution as the number of particles divided by the total             number of particles, w_(ij)=N_(ij)/N.         -   v. If overlapped, add this solution to the list of possible             solutions. -   4. Sort the list of possible solutions by relative likelihood. -   5. Compute the ratio of the best solution to the second best     solution. -   6. If the best solution is a union solution or the best solution is     part of the union with the second best solution, apply the special     intersection logic described below. Otherwise, compute the ratio of     the best to second best solution and output this ratio with the     map-match solution.

Intersection Cases

If the best solution is part of the union with the second best solution, then special intersection logic applies. The desired behavior is to create lag in the filtered output so that the solution is biased to the intersection entry until enough information is present to leave the intersection and transition onto the correct road. These additional steps apply.

-   1. Compare the relative likelihood of the incoming road link with     the outgoing road link using a ratio test. -   2. If the outgoing solution passes the ratio test, then output this     solution as the map-match. -   3. If the ratio test fails, then use the solution from only the     incoming link. One might argue that the combined union of particles     from the incoming and outgoing road links should be used but this     could pull the solution onto the wrong outgoing link and cause a     re-route.

Assessing Number of Particles Needed

A well-designed particle filter will run with a low level of solution degeneracy. A suitable measure of degeneracy is the effective sample size, N_(eff), which is given by

$\begin{matrix} {N_{eff} = {\frac{1}{\sum\limits_{i = 1}^{N}\left( w_{i} \right)^{2}}.}} & \lbrack 21\rbrack \end{matrix}$

If N_(eff) is close to 1, the solution is degenerate. However, N_(eff) is computed prior to resampling, and in some intersection cases, one or two particles will best represent the possible solution, and N_(eff) for the subsequent epoch will be valid.

On Road Versus Off Road

If the user is not on the road, then the assumption that the solution is constrained by the road network is incorrect. This case can be handled with a state machine that has entry and exit criteria for On Road versus Off Road. The criteria to reach the Off Road state are tested first and include:

If the GPS speed is valid and less than a threshold:

-   -   Activity Context==Running     -   Activity Context==Walking with better than low reliability     -   Distance cross check fails gross distance test     -   Course cross check fails course difference test (with         hysteresis)     -   Ratio test fails (with hysteresis)         else:         If the Off Road state is not achieved then the On Road state         criteria are tested. The entrance and exit for On Road state         include the following conditions:     -   If GPS speed is valid and higher than a threshold:         -   The ratio test passes for at least two consecutive epochs             else:

The state is indeterminate.

The conditions to Not Match are given by [22]

$\begin{matrix} {{{\hat{\sigma}}_{0}^{2} = \frac{\left( {z_{k} - x_{j}} \right)^{T}{R_{k}^{- 1}\left( {z_{k} - x_{j}} \right)}}{m}},} & \lbrack 22\rbrack \end{matrix}$

where

z_(k) is the vector of measurements for the k^(th) epoch

x_(j) is the vector of road link states for road link point j

R_(k) is the measurement covariance matrix

m is the degrees of freedom, length (z_(k))

If {circumflex over (σ)}₀ ²<=1:

-   -   The snap solution matches the observation very well.         If {circumflex over (σ)}₀ ²>1:     -   There is mismatch between the observation and the snap point.     -   The snap or the observation could be biased.     -   The snap could be good but the observation uncertainty is poorly         modeled. For example, if the observation is 5 m from the snap         point but has a DRMS uncertainty of 150 m.     -   The snap position could be good but the direction of travel may         mismatch due to map vector quantization. The outbound road at an         intersection is digitized to a distinct direction of travel.         Quantization of the map vector thus leads to higher variance         factors when starting a turn until the observation direction of         travel matches the road vector. One way to reduce the effect on         the variance factor is to increase the observation direction of         travel uncertainty when turning close to an intersection. This         could be accomplished, when mounted, using gyro and         accelerometer measurements at, for example, 10 Hz.     -   The snap could be good but the observations are biased. For         example, a 50 m along track error in downtown San Francisco.         If {circumflex over (σ)}₀ ²>>1:     -   The snap cannot be trusted because it is incorrect or the         observation is biased.

Using Road Width Information to Evaluate Candidate Road Points

Roads can be represented in a map database by a vector along the centerline of the road. Given an estimated position input (e.g., GPS data), we want to evaluate candidate road points given the input and road width information. Due to an error in position estimate (e.g., GPS position estimate), a position estimate can be located off the road. In these cases, a candidate road point can be located on the road but not on the centerline by moving the estimated position a distance d to a point on the road. Referring to the geometry shown in FIG. 11 (assuming only cross-track error), the distance d is given by

D=√{square root over (dE ² +dN ²)}  (23)

d=D−r _(w),  (24)

where, r_(w), is known road width and dE and dN are changes in direction in the east and north directions, respectively due to the position estimate. Roads can be classified in the system, where each road has a known width (e.g., a freeway road class). Cases where there is an along track error can be similarly evaluated based on geometry. This allows evaluation of candidate road points on the road rather than on the road centerline.

Map-Matching for Pedestrians

In most cases, it may not be desirable to snap a pedestrian to a road. However, there are instances when GPS data is prone to error, such as in a dense urban environment. In these cases, a delta value can be added to a GPS position estimate to “snap” the pedestrian onto the road, and thus constrain the solution to be on the road. In some implementations, an example delta value can be x times (e.g., x=3) the road width, r_(w).

In some implementations, logic can be used to assist map matching when the device is in a dense urban environment. For example, a GPS receiver operating in a lower power mode could indicate that the device is in a dense urban environment. A lack of access points in a WiFi scan result could also indicate that the device is in a dense urban environment. In some implementations, pattern recognition algorithms can be applied to GPS signal strength to determine when the device is in a dense urban environment. Other logic for indicating GPS error prone environments is also possible.

Exemplary System

FIG. 8 is a block diagram of a system 800 for determining location and direction of travel using map vector constraints. In some implementations, system 800 can include turn-by-turn routing module 804, map matcher module 808, location manager 812 and positioning system 814 (e.g., GPS).

The processes described above can be performed by map matcher module 808. Map matcher 808 can be implemented in software, firmware, hardware or any combination of these. Map matcher 808 receives map network information 802, turn-by-turn routing data 804 and activity context data 810. Map matcher 808 processes this information as previously described in reference to FIGS. 1-7, and outputs map matching results to location manager 812.

Location manager 812 receives map network information 802, WiFi location data 806 and altitude data 818. Location manager 812 communicates with GPS module 814, which receives sensor data from motion sensors, such as accelerometers and gyros, for example. Location manager 812 outputs user location data to other applications.

Exemplary Operating Environment

FIG. 9 is a block diagram of an exemplary operating environment capable of determining location and direction of travel of a mobile device using map vector constraints.

In some implementations, devices 902 a and 902 b can communicate over one or more wired or wireless networks 910. For example, wireless network 912 (e.g., a cellular network) can communicate with a wide area network (WAN) 914 (e.g., the Internet) by use of gateway 916. Likewise, access device 918 (e.g., IEEE 802.11g wireless access device) can provide communication access to WAN 914. Devices 902 a, 902 b can be any device capable of displaying GUIs of the disclosed content authoring application, including but not limited to portable computers, smart phones and electronic tablets. In some implementations, the devices 902 a, 902 b do not have to be portable but can be a desktop computer, television system, kiosk system or the like.

In some implementations, both voice and data communications can be established over wireless network 912 and access device 918. For example, device 902 a can place and receive phone calls (e.g., using voice over Internet Protocol (VoIP) protocols), send and receive e-mail messages (e.g., using SMPTP or Post Office Protocol 3 (POP3)), and retrieve electronic documents and/or streams, such as web pages, photographs, and videos, over wireless network 912, gateway 916, and WAN 914 (e.g., using Transmission Control Protocol/Internet Protocol (TCP/IP) or User Datagram Protocol (UDP)). Likewise, in some implementations, device 902 b can place and receive phone calls, send and receive e-mail messages, and retrieve electronic documents over access device 918 and WAN 914. In some implementations, device 902 a or 902 b can be physically connected to access device 918 using one or more cables and access device 918 can be a personal computer. In this configuration, device 902 a or 902 b can be referred to as a “tethered” device.

Devices 902 a and 902 b can also establish communications by other means. For example, wireless device 902 a can communicate with other wireless devices (e.g., other devices 902 a or 902 b, cell phones) over the wireless network 912. Likewise, devices 902 a and 902 b can establish peer-to-peer communications 920 (e.g., a personal area network) by use of one or more communication subsystems, such as the Bluetooth™ communication devices. Other communication protocols and topologies can also be implemented.

Devices 902 a or 902 b can communicate with service 930 over the one or more wired and/or wireless networks 910. For example, service 930 can be a mapping service that provides a mapping data that can be used by a client application on a device to provide the features and processes described in reference to FIGS. 1-8.

Device 902 a or 902 b can also access other data and content over one or more wired and/or wireless networks 910. For example, content publishers, such as news sites, Really Simple Syndication (RSS) feeds, Web sites and developer networks can be accessed by device 902 a or 902 b. Such access can be provided by invocation of a web browsing function or application (e.g., a browser) running on the device 902 a or 902 b.

Devices 902 a and 902 b can exchange files over one or more wireless or wired networks 910 either directly or through service 930.

Exemplary Device Architecture

FIG. 10 is a block diagram of an exemplary architecture of a device capable of determining location and direction of travel using map vector constraints.

Architecture 1000 can be implemented in any device for generating the features described in reference to FIGS. 1-8, including but not limited to portable or desktop computers, smart phones and electronic tablets, television systems, game consoles, kiosks and the like. Architecture 1000 can include memory interface 1002, data processor(s), image processor(s) or central processing unit(s) 1004, and peripherals interface 1006. Memory interface 1002, processor(s) 1004 or peripherals interface 1006 can be separate components or can be integrated in one or more integrated circuits. The various components can be coupled by one or more communication buses or signal lines.

Sensors, devices, and subsystems can be coupled to peripherals interface 1006 to facilitate multiple functionalities. For example, motion sensor 1010, light sensor 1012, and proximity sensor 1014 can be coupled to peripherals interface 1006 to facilitate orientation, lighting, and proximity functions of the device. For example, in some implementations, light sensor 1012 can be utilized to facilitate adjusting the brightness of touch surface 1046. In some implementations, motion sensor 1010 (e.g., an accelerometer, gyros) can be utilized to detect movement and orientation of the device. Accordingly, display objects or media can be presented according to a detected orientation (e.g., portrait or landscape).

Other sensors can also be connected to peripherals interface 1006, such as a temperature sensor, a biometric sensor, or other sensing device, to facilitate related functionalities.

Location processor 1015 (e.g., GPS receiver) can be connected to peripherals interface 1006 to provide geo-positioning. Electronic magnetometer 1016 (e.g., an integrated circuit chip) can also be connected to peripherals interface 1006 to provide data that can be used to determine the direction of magnetic North. Thus, electronic magnetometer 1016 can be used as an electronic compass.

Camera subsystem 1020 and an optical sensor 1022, e.g., a charged coupled device (CCD) or a complementary metal-oxide semiconductor (CMOS) optical sensor, can be utilized to facilitate camera functions, such as recording photographs and video clips.

Communication functions can be facilitated through one or more communication subsystems 1024. Communication subsystem(s) 1024 can include one or more wireless communication subsystems. Wireless communication sub systems 1024 can include radio frequency receivers and transmitters and/or optical (e.g., infrared) receivers and transmitters. Wired communication system can include a port device, e.g., a Universal Serial Bus (USB) port or some other wired port connection that can be used to establish a wired connection to other computing devices, such as other communication devices, network access devices, a personal computer, a printer, a display screen, or other processing devices capable of receiving or transmitting data. The specific design and implementation of the communication subsystem 1024 can depend on the communication network(s) or medium(s) over which the device is intended to operate. For example, a device may include wireless communication subsystems designed to operate over a global system for mobile communications (GSM) network, a GPRS network, an enhanced data GSM environment (EDGE) network, 802.x communication networks (e.g., WiFi, WiMax, or 3G networks), code division multiple access (CDMA) networks, and a Bluetooth™ network. Communication subsystems 1024 may include hosting protocols such that the device may be configured as a base station for other wireless devices. As another example, the communication subsystems can allow the device to synchronize with a host device using one or more protocols, such as, for example, the TCP/IP protocol, HTTP protocol, UDP protocol, and any other known protocol.

Audio subsystem 1026 can be coupled to a speaker 1028 and one or more microphones 1030 to facilitate voice-enabled functions, such as voice recognition, voice replication, digital recording, and telephony functions.

I/O subsystem 1040 can include touch controller 1042 and/or other input controller(s) 1044. Touch controller 1042 can be coupled to a touch surface 1046. Touch surface 1046 and touch controller 1042 can, for example, detect contact and movement or break thereof using any of a number of touch sensitivity technologies, including but not limited to capacitive, resistive, infrared, and surface acoustic wave technologies, as well as other proximity sensor arrays or other elements for determining one or more points of contact with touch surface 1046. In one implementation, touch surface 1046 can display virtual or soft buttons and a virtual keyboard, which can be used as an input/output device by the user.

Other input controller(s) 1044 can be coupled to other input/control devices 1048, such as one or more buttons, rocker switches, thumb-wheel, infrared port, USB port, and/or a pointer device such as a stylus. The one or more buttons (not shown) can include an up/down button for volume control of speaker 1028 and/or microphone 1030.

In some implementations, device 1000 can present recorded audio and/or video files, such as MP3, AAC, and MPEG files. In some implementations, device 1000 can include the functionality of an MP3 player and may include a pin connector for tethering to other devices. Other input/output and control devices can be used.

Memory interface 1002 can be coupled to memory 1050. Memory 1050 can include high-speed random access memory or non-volatile memory, such as one or more magnetic disk storage devices, one or more optical storage devices, or flash memory (e.g., NAND, NOR). Memory 1050 can store operating system 1052, such as Darwin, RTXC, LINUX, UNIX, OS X, WINDOWS, or an embedded operating system such as VxWorks. Operating system 1052 may include instructions for handling basic system services and for performing hardware dependent tasks. In some implementations, operating system 1052 can include a kernel (e.g., UNIX kernel).

Memory 1050 may also store communication instructions 1054 to facilitate communicating with one or more additional devices, one or more computers or servers. Communication instructions 1054 can also be used to select an operational mode or communication medium for use by the device, based on a geographic location (obtained by the GPS/Navigation instructions 1068) of the device. Memory 1050 may include graphical user interface instructions 1056 to facilitate graphic user interface processing, such as generating the GUIs shown in FIGS. 1-8 and 11; sensor processing instructions 1058 to facilitate sensor-related processing and functions; phone instructions 1060 to facilitate phone-related processes and functions; electronic messaging instructions 1062 to facilitate electronic-messaging related processes and functions as described in reference to FIGS. 1-8 and 11; web browsing instructions 1064 to facilitate web browsing-related processes and functions; media processing instructions 1066 to facilitate media processing-related processes and functions; GPS/Navigation instructions 1068 to facilitate GPS and navigation-related processes; camera instructions 1070 to facilitate camera-related processes and functions; and location map matching instructions 1072, which implement the processes described in reference to FIGS. 1-8 and 11. The memory 1050 may also store other software instructions for facilitating other processes, features and applications, such as applications related to navigation, social networking, location-based services or map displays.

Each of the above identified instructions and applications can correspond to a set of instructions for performing one or more functions described above. These instructions need not be implemented as separate software programs, procedures, or modules. Memory 1050 can include additional instructions or fewer instructions. Furthermore, various functions of the mobile device may be implemented in hardware and/or in software, including in one or more signal processing and/or application specific integrated circuits.

The features described can be implemented in digital electronic circuitry or in computer hardware, firmware, software, or in combinations of them. The features can be implemented in a computer program product tangibly embodied in an information carrier, e.g., in a machine-readable storage device, for execution by a programmable processor; and method steps can be performed by a programmable processor executing a program of instructions to perform functions of the described implementations by operating on input data and generating output.

The described features can be implemented advantageously in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. A computer program is a set of instructions that can be used, directly or indirectly, in a computer to perform a certain activity or bring about a certain result. A computer program can be written in any form of programming language (e.g., Objective-C, Java), including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment.

Suitable processors for the execution of a program of instructions include, by way of example, both general and special purpose microprocessors, and the sole processor or one of multiple processors or cores, of any kind of computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memories for storing instructions and data. Generally, a computer can communicate with mass storage devices for storing data files. These mass storage devices can include magnetic disks, such as internal hard disks and removable disks; magneto-optical disks; and optical disks. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, ASICs (application-specific integrated circuits).

To provide for interaction with an author, the features can be implemented on a computer having a display device such as a CRT (cathode ray tube) or LCD (liquid crystal display) monitor for displaying information to the author and a keyboard and a pointing device such as a mouse or a trackball by which the author can provide input to the computer.

The features can be implemented in a computer system that includes a back-end component, such as a data server or that includes a middleware component, such as an application server or an Internet server, or that includes a front-end component, such as a client computer having a graphical user interface or an Internet browser, or any combination of them. The components of the system can be connected by any form or medium of digital data communication such as a communication network. Examples of communication networks include a LAN, a WAN and the computers and networks forming the Internet.

The computer system can include clients and servers. A client and server are generally remote from each other and typically interact through a network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.

One or more features or steps of the disclosed embodiments can be implemented using an Application Programming Interface (API). An API can define on or more parameters that are passed between a calling application and other software code (e.g., an operating system, library routine, function) that provides a service, that provides data, or that performs an operation or a computation.

The API can be implemented as one or more calls in program code that send or receive one or more parameters through a parameter list or other structure based on a call convention defined in an API specification document. A parameter can be a constant, a key, a data structure, an object, an object class, a variable, a data type, a pointer, an array, a list, or another call. API calls and parameters can be implemented in any programming language. The programming language can define the vocabulary and calling convention that a programmer will employ to access functions supporting the API.

In some implementations, an API call can report to an application the capabilities of a device running the application, such as input capability, output capability, processing capability, power capability, communications capability, etc.

A number of implementations have been described. Nevertheless, it will be understood that various modifications may be made. The systems and techniques presented herein are also applicable to other electronic text such as electronic newspaper, electronic magazine, electronic documents etc. Elements of one or more implementations may be combined, deleted, modified, or supplemented to form further implementations. As yet another example, the logic flows depicted in the figures do not require the particular order shown, or sequential order, to achieve desirable results. In addition, other steps may be provided, or steps may be eliminated, from the described flows, and other components may be added to, or removed from, the described systems. Accordingly, other implementations are within the scope of the following claims. 

What is claimed is:
 1. A method comprising: performing, by a particle filter running on a computing device, particle seeding on an outdoor road network based on a satellite-based position measurement, wherein the particle seeding includes: determining a measure of position uncertainty associated with the satellite-based position measurement; determining a distance based at least in part on the measure of position uncertainty; selecting a set of one or more road links in the road network that are within the distance of the satellite-based position measurement; assigning a particle to each road link in the set of one or more road links; determining a score for each assigned particle; and determining a relative likelihood value for each assigned particle; calculating, by the computing device, relative particle weights; resampling, by the computing device, the particles; computing, by the computing device, a particle filter solution; comparing, by the computing device, the particle filter solution with an instantaneous matcher; and calculating, by the computing device, a map-match given the particles, wherein the method is performed by one or more hardware processors of the computing device.
 2. The method of claim 1, wherein selecting a set of one or more road links in the road network that are within a distance of the satellite-based position measurement and assigning a particle to each road link, further comprises: determining a closest point on each road link in the set of one or more road links based on the distance and a direction of travel for the closest point; and assigning a particle to the closest point.
 3. The method of claim 2, wherein the set of one or more road links is selected based on road width and changes in direction to the satellite-based position measurement.
 4. The method of claim 1, further comprising: determining, by the computing device, a ratio of a highest to a second highest relative likelihood values; determining, by the computing device, that the ratio exceeds a threshold; and responsive to the determining, generating an instantaneous map-match solution.
 5. The method of claim 1, wherein the score is determined from a multivariate normal distribution given by ${{p\left( z_{k} \middle| x_{j} \right)} = {\frac{1}{\sqrt{\left( {2\pi} \right)^{n}{R_{k}}}}^{{- \frac{1}{2}}{({z_{k} - x_{j}})}^{T}}{R_{k}^{- 1}\left( {z_{k} - x_{j}} \right)}}},$ and where p(z_(k)|x_(j)) is the probability of the measurements x_(j) given a specific road link point, n is the number of satellite-based measurements, z_(k) is a vector of measurements for a k^(th) epoch and R_(k) is a measurement covariance matrix.
 6. The method of claim 5, wherein the relative likelihood value for a jth particle w_(j) is given by ${w_{j} = \frac{p\left( z_{k} \middle| x_{j} \right)}{\sum\limits_{i = 1}^{N}{p\left( z_{k} \middle| x_{j} \right)}}},$ and where N is a positive integer equal to the number of particles.
 7. The method of claim 1, wherein propagating the particles along the road network further comprises: determining, by the computing device, a motion context from a sensor of the computing device; determining, by the computing device, a process noise value based on the motion context; and propagating, by the computing device, the particles along road links and across intersections using the process noise value.
 8. The method of claim 1, wherein computing a particle filter solution includes computing the particle filter solution based on a union of particles propagated along two or more road links.
 9. A computing device comprising: one or more processors; memory coupled to the one or more processors and configured to store instructions, which, when executed by the one or more processors, causes the one or more processors to perform operations comprising: particle seeding for a particle filter on an outdoor road network based on a satellite-based position measurement, wherein the particle seeding includes: determining a measure of position uncertainty associated with the satellite-based position measurement; determining a distance based at least in part on the measure of position uncertainty; selecting a set of one or more road links in the road network that are within the distance of the satellite-based position measurement; assigning a particle to each road link in the set of one or more road links; determining a score for each assigned particle; and determining a relative likelihood value for each assigned particle; propagating the particles along the road network; calculating relative particle weights; resampling the particles; computing a particle filter solution; comparing the particle filter solution with an instantaneous matcher; and calculating a map-match given the particles.
 10. The computing device of claim 9, wherein selecting a set of one or more road links in the road network that are within a distance of the satellite-based position measurement and assigning a particle to each road link, further comprises: determining a closest point on each road link in the set of one or more road links based on the distance and a direction of travel for the closest point; and assigning a particle to the closest point.
 11. The computing device of claim 9, wherein the set of one or more road links is selected based on road width and changes in direction to the satellite-based position measurement.
 12. The computing device of claim 9, the operations further comprising: determining a ratio of a highest to a second highest relative likelihood values; determining that the ratio exceeds a threshold; and responsive to the determining, generating an instantaneous map-match solution.
 13. The computing device of claim 9, wherein the score is determined from a multivariate normal distribution given by ${{p\left( z_{k} \middle| x_{j} \right)} = {\frac{1}{\sqrt{\left( {2\pi} \right)^{n}{R_{k}}}}^{{- \frac{1}{2}}{({z_{k} - x_{j}})}^{T}}{R_{k}^{- 1}\left( {z_{k} - x_{j}} \right)}}},$ and where p(z_(k)|x_(j)) is the probability of the measurements x_(j) given a specific road link point, n is the number of satellite-based measurements, z_(k) is a vector of measurements for a k^(th) epoch and R_(k) is a measurement covariance matrix.
 14. The computing device of claim 13, wherein the relative likelihood value for a jth particle w_(j) is given by ${w_{j} = \frac{p\left( z_{k} \middle| x_{j} \right)}{\sum\limits_{i = 1}^{N}{p\left( z_{k} \middle| x_{j} \right)}}},$ and where N is a positive integer equal to the number of particles.
 15. The computing device of claim 9, wherein propagating the particles along the road network further comprises: determining a motion context from a sensor of the computing device; determining a process noise value based on the motion context; and propagating the particles along road links and across intersections using the process noise value.
 16. The computing device of claim 9, wherein computing a particle filter solution includes computing the particle filter solution based on a union of particles propagated along two or more road links.
 17. A non-transitory, computer-readable storage medium having instructions stored thereon, which, when executed by one or more processors, cause the one or more processors to perform operations comprising: particle seeding for a particle filter on an outdoor road network based on a satellite-based position measurement, wherein the particle seeding includes: determining a measure of position uncertainty associated with the satellite-based position measurement; determining a distance based at least in part on the measure of position uncertainty; selecting a set of one or more road links in the road network that are within the distance of the satellite-based position measurement; assigning a particle to each road link in the set of one or more road links; determining a score for each assigned particle; and determining a relative likelihood value for each assigned particle; propagating the particles along the road network; calculating relative particle weights; resampling the particles; computing a particle filter solution; comparing the particle filter solution with an instantaneous matcher; and calculating a map-match given the particles.
 18. The computer-readable storage medium of claim 17, wherein selecting a set of one or more road links in the road network that are within a distance of the satellite-based position measurement and assigning a particle to each road link, further comprises: determining a closest point on each road link in the set of one or more road links based on the distance and a direction of travel for the closest point; and assigning a particle to the closest point.
 19. The computer-readable storage medium of claim 17, wherein the set of one or more road links is selected based on road width and changes in direction to the satellite-based position measurement.
 20. The computer-readable storage medium of claim 17, the operations further comprising: determining a ratio of a highest to a second highest relative likelihood values; determining that the ratio exceeds a threshold; and responsive to the determining, generating an instantaneous map-match solution. 